Compositional workflow modeling with priority constraints

نویسندگان

چکیده

Priority is an important concept in Business Process Management (BPM), useful the context of workflow patterns such as, e.g., cancelable and compensable tasks within business transactions. Unfortunately, presence priority workflows makes them difficult to be analyzed formally by automated validation verification tools. In past, we demonstrated that Reo coordination language can successfully used for modeling, automatic model checking process models. this paper, propose a constraint-based approach formalize Reo. We introduce special channels initiate, propagate, block flows, define their semantics as constraints, propagation Constraint Satisfaction Problem (CSP). The semantic extension paper enables analysis constraints.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matroid Intersection with Priority Constraints

In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I of M1,M2 such that |I ∩A| is maximum among all common independent sets of M1,M2 and such that (secondly) |I| is maximum among all common independent sets of M1,M2 satisfying the first co...

متن کامل

A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints

One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...

متن کامل

Compositional Modeling With DPNs

Dynamic probabilistic networks (DPNs) are a powerful and efficient method for encoding stochastic temporal models. In the past, however, their use has been largely confined to the description of uniform temporal processes. In this paper we show how to combine specialized DPN models to represent inhomogeneous processes that progress through a sequence of different stages. We develop a method tha...

متن کامل

MULTI-OBJECTIVE OPTIMIZATION WITH PREEMPTIVE PRIORITY SUBJECT TO FUZZY RELATION EQUATION CONSTRAINTS

This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...

متن کامل

Dynamic Workflow Adjustment with Security Constraints

Dynamic workflow adjustment studies how to minimally adjust existing user-task assignments, when a sudden change occurs, e.g. absence of users, so that all tasks are being attended and no constraint is violated. In particular, we study two key questions: (i) Will the workflow still be satisfiable given a change? (ii) If the answer is yes, how to find a satisfying assignment with the minimum per...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2021

ISSN: ['1872-7964', '0167-6423']

DOI: https://doi.org/10.1016/j.scico.2020.102578